A unified approximation algorithm for node-deletion problems
نویسندگان
چکیده
منابع مشابه
A Unified Approximation Algorithm for Node-deletion Problems
In this paper we consider a unified (polynomial time) approximation method for node-deletion problems with nontrivial and hereditary graph properties. One generic algorithm scheme is presented, which can be applied to any node-deletion problem for finding approximate solutions. It will be shown then that the quality of solutions found by this algorithm is determined by the quality of any minima...
متن کاملA Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties
This paper is concerned with the polynomial time approximability of node{deletion problems for hereditary properties. We will focus on such graph properties that are derived from matroids de nable on the edge set of any graph. It will be shown rst that all the node{deletion problem for such properties can be uniformly formulated by a simple but non{standard form of the integer program. A primal...
متن کاملA Uni ed Local Ratio Approximation of Node { Deletion Problems ( Extended
In this paper we consider a uni ed approximation method for node{deletion problems with nontrivial and hereditary graph properties. It was proved 16 years ago that every node{deletion problems for a nontrivial hereditary property is NP{complete via a few generic approximation preserving reductions from the Vertex Cover problem. An open problem posed at that time is concerned with the other dire...
متن کاملA Successive Approximation Algorithm for Coordination Problems
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), exploits structured interaction to produce significant computational gains. Empirically, CSA exhibits very good anytime performance, but an error bound on the results has not been established. We reformulate the algorithm a...
متن کاملApproximation Algorithm for Facility Location Problems
J. Stollsteimer, "A working model for plant numbers and locations," Journal of Farm Economics, vol. 45, pp. 631–645, 1963. A. A. Kuehn and M. J. Hamburger, "A heuristic program for locating warehouse," Management Science, vol. 9, pp. 643–666, 1963. A. Manne, "A plant location and economy of scale decentralization and computation," Management Science, vol. 11, pp. 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00035-3